Approximate Integrals Over Bounded Volumes with Smooth Boundaries

Meshing Volumes Bounded by Smooth Surfaces

This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The algorithm combines a Delaunaybased surface mesher with a Ruppert-like volume mesher, to get a greedy algorithm that samples the interior and the boundary of the domain at once. The algorithm constructs provably-good meshes, it gives control on the size of the mesh elements through a u...

Bounded Approximate Character Amenability of Banach Algebras

The bounded approximate version of $varphi$-amenability and character amenability are introduced and studied. These new notions are characterized in several different ways, and some hereditary properties of them are established. The general theory for these concepts is also developed. Moreover, some examples are given to show that these notions are different from the others. Finally, bounded ap...

Smooth Optimization with Approximate Gradient

We show that the optimal complexity of Nesterov’s smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded error. In applications of this method to semidefinite programs, this often means computing only a few dominant eigenvalues of the current iterate instead of a full matrix exponential, which significantly reduces the method’s...

Distributed Network Querying with Bounded Approximate Caching

As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build, and evaluate a scalable infrastructure for answering queries over distributed measurements, at reduced costs (in terms of both network traffic and query latency) while maintaining required precision. In this infrastructure, e...

Maillages de volumes bornés par des surfaces lisses par morceaux. (Meshing Volumes bounded by Piecewise Smooth Surfaces)